A New Model of Parallel Distributed Genetic Algorithms for Cluster Systems: Dual Individual DGAs

نویسندگان

  • Tomoyuki Hiroyasu
  • Mitsunori Miki
  • Masahiro Hamasaki
  • Yusuke Tanimura
چکیده

A new model of parallel distributed genetic algorithm, Dual Individual Distributed Genetic Algorithm (DuDGA), is proposed. This algorithm frees the user from having to set some parameters because each island of Distributed Genetic Algorithm (DGA) has only two individuals. DuDGA can automatically determine crossover rate, migration rate, and island number. Moreover, compared to simple GA and DGA methods, DuDGA can nd better solutions with fewer analyses. Capability and e ectiveness of the DuDGA method are discussed using four typical numerical test functions.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Static Task Allocation in Distributed Systems Using Parallel Genetic Algorithm

Over the past two decades, PC speeds have increased from a few instructions per second to several million instructions per second. The tremendous speed of today's networks as well as the increasing need for high-performance systems has made researchers interested in parallel and distributed computing. The rapid growth of distributed systems has led to a variety of problems. Task allocation is a...

متن کامل

A New Model of Distributed Genetic Algorithm for Cluster Systems: Dual Individual DGA

In this study, a new model of distributed genetic algorithm (DGA) for cluster systems is proposed. That is called Dual Individual Distributed Genetic Algorithm: DuDGA. DGA is a very good parallel model of genetic algorithms, because the necessary network traÆc is not so heavy. On the other hand, DGA needs additional parameters to simple GA such as migration rate and migration intervals. In the ...

متن کامل

A Memtic genetic algorithm for a redundancy allocation problem

Abstract In general redundancy allocation problems the redundancy strategy for each subsystem is predetermined. Tavakkoli- Moghaddam presented a series-parallel redundancy allocation problem with mixing components (RAPMC) in which the redundancy strategy can be chosen for individual subsystems. In this paper, we present a bi-objective redundancy allocation when the redundancy strategies for...

متن کامل

A Message-Passing Distributed Memory Parallel Algorithm for a Dual-Code Thin Layer, Parabolized Navier-Stokes Solver

In this study, the results of parallelization of a 3-D dual code (Thin Layer, Parabolized Navier-Stokes solver) for solving supersonic turbulent flow around body and wing-body combinations are presented. As a serial code, TLNS solver is very time consuming and takes a large part of memory due to the iterative and lengthy computations. Also for complicated geometries, an exceeding number of grid...

متن کامل

Genetic Algorithm and Simulated Annealing for Redundancy Allocation Problem with Cold-standby Strategy

This paper presents a new mathematical model for a redundancyallocation problem (RAP) withcold-standby redundancy strategy and multiple component choices.The applications of the proposed model arecommon in electrical power, transformation,telecommunication systems,etc.Manystudies have concentrated onone type of time-to-failure, butin thispaper, two components of time-to-failures which follow hy...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000